Some remarks on the geodetic number of a graph

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Some remarks on the geodetic number of a graph

A set of vertices D of a graph G is geodetic if every vertex of G lies on a shortest path between two not necessarily distinct vertices in D. The geodetic number of G is the minimum cardinality of a geodetic set of G. We prove that it is NP complete to decide for a given chordal or chordal bipartite graph G and a given integer k whether G has a geodetic set of cardinality at most k. Furthermore...

متن کامل

The forcing geodetic number of a graph

For two vertices u and v of a graph G, the set I(u, v) consists of all vertices lying on some u − v geodesic in G. If S is a set of vertices of G, then I(S) is the union of all sets I(u, v) for u, v ∈ S. A set S is a geodetic set if I(S) = V (G). A minimum geodetic set is a geodetic set of minimum cardinality and this cardinality is the geodetic number g(G). A subset T of a minimum geodetic set...

متن کامل

On the Open Geodetic Number of a Graph

For a connected graph G of order n, a set S ⊆ V (G) is a geodetic set of G if each vertex v ∈ V (G) lies on a x-y geodesic for some elements x and y in S. The minimum cardinality of a geodetic set of G is defined as the geodetic number of G, denoted by g(G). A geodetic set of cardinality g(G) is called a g-set of G. A set S of vertices of a connected graph G is an open geodetic set of G if for ...

متن کامل

On pitfalls in computing the geodetic number of a graph

Given a simple connected graph G = (V, E) the geodetic closure I[S] ⊂ V of a subset S of V is the union of all sets of nodes lying on some geodesic (or shortest path) joining a pair of nodes vk, vl ∈ S. The geodetic number, denoted by g(G), is the smallest cardinality of a node set S∗ such that I[S∗] = V . In “The geodetic number of a graph”, Mathematical and Computer Modelling 17 (June 1993) 8...

متن کامل

Double geodetic number of a graph

For a connected graph G of order n, a set S of vertices is called a double geodetic set of G if for each pair of vertices x, y in G there exist vertices u, v ∈ S such that x, y ∈ I[u, v]. The double geodetic number dg(G) is the minimum cardinality of a double geodetic set. Any double godetic of cardinality dg(G) is called dg-set of G. The double geodetic numbers of certain standard graphs are o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Discrete Mathematics

سال: 2010

ISSN: 0012-365X

DOI: 10.1016/j.disc.2009.09.018